Slim fast

Fast and Slim Lifted Markov Chains

Metropolis-Hasting method allows for designing a reversible Markov chain P on a given graph G for a target stationary distribution π. Such a Markov chain may suffer from its slow mixing time due to reversibility. Diaconis, Holmes and Neal (1997) for the ring-like chain P , and later Chen, Lovasz and Pak (2002) for an arbitrary chain P provided an explicit construction of a non-reversible Markov...

Slim Groupoids

Slim groupoids are groupoids satisfying x(yz) ≈ xz. We find all simple slim groupoids and all minimal varieties of slim groupoids. Every slim groupoid can be embedded into a subdirectly irreducible slim groupoid. The variety of slim groupoids has the finite embeddability property, so that the word problem is solvable. We introduce the notion of a strongly nonfinitely based slim groupoid (such g...

Slim Binaries , 1997

syntax tree data dictionary object file write sequence update dictionary find best sequence write interface add symbols i, j, P := i 1 i+1 P(•) i+1 +

Schlanke Körper (Slim fields)

We examine fields in which model theoretic algebraic closure coincides with relative field theoretic algebraic closure. These are perfect fields with nice model theoretic behaviour. For example, they are exactly the fields in which algebraic independence is an abstract independence relation in the sense of Kim and Pillay. Classes of examples are perfect PAC fields, model complete large fields a...

Thin clients: slim security?